a new multi-mode and multi-product hub covering problem‎: ‎a priority m/m/c queue ‎approach

نویسندگان

s. sedehzadeh‎

r. tavakkoli-‎moghaddam‎‎

f. jolai‎

چکیده

one main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. this paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. indeed, the nature of products is considered different and hub capacity constraint is also applied. due to the transport volume and related traffic, a new priority m/m/c queuing system is considered, in which products with high priority are selected for service ahead of those with low priority. the objectives of this model minimize the total transportation cost and total time. besides, because of the computational complexity, a multi-objective parallel simulated annealing (mopsa) algorithm is proposed and some computational experiments are provided to illustrate the efficiency of the presented model and proposed mopsa algorithm. the performance of this algorithm is compared with two well-known multi-objective evolutionary algorithms, namely non-dominated sorting genetic algorithm (nsga-ii) and pareto archive evolution strategy (paes)‎.‎

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new multi-mode and multi-product hub covering problem‎: ‎A priority M/M/c queue ‎approach

One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...

متن کامل

A new multi-mode and multi-product hub covering problem: A priority M/M/c queue approach

One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...

متن کامل

Bi-objective Optimization of a Multi-product multi-period Fuzzy Possibilistic Capacitated Hub Covering Problem: NSGA-II and NRGA Solutions

The hub location problem is employed for many real applications, including delivery, airline and telecommunication systems and so on. This work investigates on hierarchical hub network in which a three-level network is developed. The central hubs are considered at the first level, at the second level, hubs are assumed which are allocated to central hubs and the remaining nodes are at the third ...

متن کامل

Solving a New Priority M/m/c Queue Model for a Multi- Mode Hub Covering Location Problem by Multi- Objective Parallel Simulated Annealing

In this paper, a new priority M/M/c queuing hub covering problem is presented, in which products with high priority are selected for service ahead of those with low priority. In addition, a mixed-integer nonlinear mathematical programming model is presented to find a good solution of the given problem. Due to its computational complexity, we propose a multi-objective parallel simulated annealin...

متن کامل

solving a multi-objective hub covering location problem with congestion by a new algorithm considering a queue theory

hub covering problem (hlp) is a very popular areas of research for its wide ranges of applications in different service or manufacturing industries. this paper considers a bi-objective hub covering location problem with congestion. the objectives minimize the total transportation cost and the total waiting time for all hobs, respectively. the resulted multi-objective decision-making problem is ...

متن کامل

solution of security constrained unit commitment problem by a new multi-objective optimization method

چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
international journal of industrial mathematics

ناشر: science and research branch, islamic azad university, tehran, iran

ISSN 2008-5621

دوره 7

شماره 2 2015

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023